翻訳と辞書 |
Cyclic negation : ウィキペディア英語版 | Cyclic negation In many-valued logic with linearly ordered truth values, cyclic negation is a unary truth function that takes a truth value ''n'' and returns ''n'' − 1 as value if ''n'' isn't the lowest value; otherwise it returns the highest value. For example, let the set of truth values be , let ~ denote negation, and let ''p'' be a variable ranging over truth values. For these choices, if p = 0 then ~p = 2; and if p = 1 then ~p = 0. Cyclic negation was originally introduced by the logician and mathematician Emil Post. ==References==
*. See in particular (pp. 188–189 ).
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Cyclic negation」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|